Clustering Search Heuristic for the Capacitated p -Median Problem
نویسندگان
چکیده
In this paper we present a hybrid heuristic for the capacitated pmedian problem (CPMP). This problem considers a set of n points, each of them with a known demand, the objective consists of finding p medians and assign each point to exactly one median such that the total distance of assigned points to their corresponding medians is minimized, and the a capacity limit on the medians may not be exceeded. The purpose of this paper is to present a new hybrid heuristic to solve the CPMP, called Clustering Search (CS), which consists in detecting promising search areas based on clustering. Computational results show that the CS found the best known solutions in all most instances.
منابع مشابه
A Hybrid Approach for Optimization of Capacitated Centered Clustering Problem
Capacitated Centered Clustering problem (CPMP) is an important variation of p-median problems. The p-median problems are known to be NP-hard. A hybrid genetic algorithm is used to solve the problem efficiently. The analysis shows that the performance of the proposed algorithm is better than the traditional local search heuristic.
متن کاملحل مساله خوشهبندی ظرفیتدار با استفاده از روشهای مبتنی بر الگوریتمهای شبیه سازی تبریدی و ژنتیک
The Capacitated Clustering Problem (CCP) is a classical location problem with various applications in data mining. In the capacitated clustering problem, a set of n entities is to be partitioned into p disjoint clusters, such that the total dissimilarity within each cluster is minimized subject to constraints on maximum cluster capacity. Dissimilarity of a cluster is the sum of the dissimilar...
متن کاملA novel heuristic algorithm for capacitated vehicle routing problem
The vehicle routing problem with the capacity constraints was considered in this paper. It is quite difficult to achieve an optimal solution with traditional optimization methods by reason of the high computational complexity for large-scale problems. Consequently, new heuristic or metaheuristic approaches have been developed to solve this problem. In this paper, we constructed a new heuristic ...
متن کاملAn Efficient Hybrid Metaheuristic for Capacitated p-Median Problem
Capacitated p-median problem (CPMP) is a well-known facility-location problem, in which p capacitated facility points are selected to satisfy n demand points in such a way that the total assigned demand to each facility does not exceed its capacity. Minimizing the total sum of distances between each demand point and its nearest facility point is the objective of the problem. Developing an effic...
متن کاملThree Meta-heuristic Algorithms for the Single-item Capacitated Lot-sizing Problem (RESEARCH NOTE)
This paper proposes a mixed integer programming model for single-item capacitated lot-sizing problem with setup times, safety stock, demand shortages, outsourcing and inventory capacity. Due to the complexity of problem, three meta-heuristics algorithms named simulated annealing (SA), vibration damping optimization (VDO) and harmony search (HS) have been used to solve this model. Additionally, ...
متن کامل